翻訳と辞書 Words near each other ・ Huoying Station ・ HUOZHONG ・ Huozhou ・ HUP ・ Hup (album) ・ Hup Holland Hup ・ Hup language ・ Hup people ・ Hupa ・ Hupa (disambiguation) ・ Hupa language ・ Hupa traditional narratives ・ Hupac ・ Hupacasath First Nation ・ Hupari ・ Hunt–McIlroy algorithm ・ Hunua ・ Hunua (disambiguation) ・ Hunua (New Zealand electorate) ・ Hunua Ranges ・ Hunuange Bogaskumburegammedda ・ Hunuange Imbulkotadeniya ・ Hunucmá Municipality ・ Hunugalagala Limestone Cave ・ Hunugalpitiya ・ Hunuketa-ela ・ Hunuketawala ・ Hunuketella ・ Hunut ・ Hunveyor Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hunt–McIlroy algorithm ： ウィキペディア英語版 Hunt–McIlroy algorithm In computer science, the Hunt–McIlroy algorithm is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff. To this day, variations of this algorithm are found in incremental version control systems, wiki engines, and molecular phylogenetics research software. The research accompanying the final version of Unix diff, written by Douglas McIlroy, was published in the 1976 paper "An Algorithm for Differential File Comparison", co-written with James W. Hunt, who developed an initial prototype of diff. ==Algorithm== The Hunt–McIlroy algorithm is a modification to a basic solution for the longest common subsequence problem. The solution is modified so that there are lower time and space requirements for the algorithm when it is working with typical inputs. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hunt–McIlroy algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.